Journal of Computational Physics–480 www.elsevier.com/locate/jcp High order numerical methods for the space non-homogeneous Boltzmann equation Francis Filbet a, Giovanni Russo

Source URL: www.dmi.unict.it

• Mathematical analysis
• Mathematics
• Mathematical physics
• Statistical mechanics
• Partial differential equations
• Numerical analysis
• Fourier analysis
• Boltzmann equation
• Fourier transform
• Spectral method
• Euler method
• Integral

doi:Communication Costs of Strassen’s Matrix Multiplication By Grey Ballard, James Demmel, Olga Holtz, and Oded Schwartz

Source URL: www.cs.huji.ac.il

• Mathematics
• Algebra
• Linear algebra
• Numerical linear algebra
• Multiplication
• Analysis of algorithms
• Matrix theory
• Matrix multiplication algorithm
• Computational complexity theory
• Matrix multiplication
• Algorithm
• Matrix

Prof. Dr. Dirk Langemann Technische Universit¨at Braunschweig Institut Computational Mathematics AG Partielle Differentialgleichungen PockelsstraßeBraunschweig

Source URL: www.tu-braunschweig.de

Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis May 19, Spring 2011

Source URL: courses.csail.mit.edu

• Computational complexity theory
• Mathematics
• Theory of computation
• Analysis of algorithms
• Operations research
• Asymptotic analysis
• Combinatorial optimization
• Dynamic programming
• Master theorem
• Big O notation
• Knapsack problem
• Time complexity

Bag of Tricks for Efficient Text Classification Edouard Grave Piotr Bojanowski Tomas Mikolov Facebook AI Research {ajoulin,egrave,bojanowski,tmikolov}@fb.com

Source URL: arxiv.org

• Artificial intelligence
• Artificial neural networks
• Computational neuroscience
• Applied mathematics
• Machine learning
• Natural language processing
• Language modeling
• Deep learning
• Convolutional neural network
• Yann LeCun
• Word embedding
• Bigram

Prof. Dr. Dirk Langemann Institut Computational Mathematics Technische Universit¨at Braunschweig PockelsstraßeBraunschweig Braunschweig, 15. April 2012

Source URL: www.tu-braunschweig.de

Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Anupam Gupta∗ Amit Kumar†

Source URL: theory.stanford.edu

• Graph theory
• Mathematics
• Computational complexity theory
• NP-complete problems
• Steiner tree problem
• XTR
• Shortest path problem
• Flow network
• Maximum flow problem
• Graph coloring

A DESCRIPTIVE TITLE, NOT TOO GENERAL, NOT TOO LONG Markus P¨uschel Department of Computer Science ETH Z¨urich Z¨urich, Switzerland The hard page limit is 6 pages in this style. Do not reduce font size or use other tri

Source URL: spcl.inf.ethz.ch

• Sorting algorithms
• Computing
• Data processing
• Mathematics
• Algorithm
• Mathematical logic
• Theoretical computer science
• Sorting
• Sort
• Computational complexity theory
• Program optimization
• Selection algorithm

A SAT-based Method for Solving the Two-dimensional Strip Packing Problem Takehide Soh1 , Katsumi Inoue12 , Naoyuki Tamura3 , Mutsunori Banbara3 , and Hidetomo Nabeshima4 1

Source URL: ceur-ws.org

• Theoretical computer science
• Computational complexity theory
• Mathematics
• Constraint programming
• Numerical software
• Automated theorem proving
• DPLL algorithm
• Packing problems
• Solver
• Constraint satisfaction
• Reduction
• Algorithm

On the Optimality of Top-k Algorithms for Interactive Web Applications∗ Yael Amsterdamer Daniel Deutch

Source URL: webdb2011.rutgers.edu

• Computational complexity theory
• Mathematics
• Edsger W. Dijkstra
• Graph theory
• Algorithm
• Mathematical logic
• Theoretical computer science
• Shortest path problem
• NP
• Dynamic programming